The maximal \alpha-index of trees with k pendent vertices and its computation
نویسندگان
چکیده
منابع مشابه
On the sum-connectivity index of unicyclic graphs with k pendent vertices
The sum-connectivity index R′(G) of a graph G is the sum of the weights (du +dv) − 2 of all edges uv of G, where du and dv are the degrees of the vertices u and v in G. This index was recently introduced in [B. Zhou, N. Trinajstić, On a novel connectivity index, J. Math. Chem. 46(2009), 1252–1270]. In this paper, we give the sharp lower bound of the sum-connectivity index of n-vertex unicyclic ...
متن کاملThe spectral radius of tricyclic graphs with n vertices and k pendent vertices
In this paper, we determine graphs with the largest spectral radius among all the tricyclic graphs with n vertices and k pendent vertices. © 2008 Elsevier Inc. All rights reserved. AMS classification: 05C50; 05C35
متن کاملMaximum Randić index on trees with k-pendant vertices
Mathematical descriptors of molecular structure, such as various topological indices, have been widely used in structure-property-activity studies (see [5, 6, 12]). Among the numerous topological indices considered in chemical graph theory, only a few have been found noteworthy in practical application (see [10]). One of these is the connectivity index or Randić index. The Randić index of an or...
متن کاملOn the spectral radii of quasi-tree graphs and quasi-unicyclic graphs with k pendent vertices
A connected graph G = (V, E) is called a quasi-tree graph if there exists a vertex u0 ∈ V (G) such that G−u0 is a tree. A connected graph G = (V, E) is called a quasi-unicyclic graph if there exists a vertex u0 ∈ V (G) such that G− u0 is a unicyclic graph. Set T (n, k) := {G : G is a n-vertex quasi-tree graph with k pendant vertices}, and T (n, d0, k) := {G : G ∈ T (n, k) and there is a vertex ...
متن کاملOn Merrifield-Simmons index of unicyclic graphs with given girth and prescribed pendent vertices
For a graph G, the Merrifield-Simmons index i(G) is defined as the total number of independent sets of the graph G. Let G(n, l, k) be the class of unicyclic graphs on n vertices with girth and pendent vertices being resp. l and k. In this paper, we characterize the unique unicyclic graph possessing prescribed girth and pendent vertices with the maximal Merrifield-Simmons index among all graphs ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Linear Algebra
سال: 2020
ISSN: 1081-3810
DOI: 10.13001/ela.2020.5065